NetLSD: Hearing the Shape of a Graph
Uploaded by: Maximimi
Upload date: 2018-09-12 14:46:39
Edited at: 2018-10-12 11:40:57
Edited by: Anton Tsitsulin

Comments:

Great title!
> Great title! Second it!
I think the paper is also nice. :)
I think this is a great paper. I like how the subject is presented, in particular the state of the art and the motivation are well-written. In my humble opinion, more papers should have an introduction as well-written as this. Although one has to readily accept that having to compare large graphs together is an important task, once this is accepted there is no ambiguity about where the authors want to lead the reader. There is a good overview of the problems with common methods in the literature, clear enough that the reader knows what is going on, yet simple enough not to feel overwhelming. Then, the authors clearly state how they positioned themselves in regard to these problems. The problem statement, in section 3, also follows this pattern of clearly exposing what is what and then using this information to expose what their contribution is. Now, I am not an expert on the subject so I can't make any serious judgment on the scope of the contribution. Some parts about scaling to large graphs seems a bit underwhelming to me, as the authors point out themselves that the Taylor expansion "provides a rather dubious approximation". Still, the theoretical work is well exposed and well developped. Thus, I expect anyone in this field could use this as a great starting point to improve on the experimental results. Overall, I wish more papers were written with such clarity. The authors took time to clearly state their problem, which enabled me, an outsider to such questions of graph comparison techniques, to easily follow their argument. This was an enjoyable read.

Please consider to register or login to comment on the paper.